Thread-Based Mobility in Oz
Identifieur interne : 001957 ( Main/Exploration ); précédent : 001956; suivant : 001958Thread-Based Mobility in Oz
Auteurs : Dragan Havelka [Suède] ; Christian Schulte [Suède] ; Per Brand [Suède] ; Seif Haridi [Suède]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2005.
Abstract
Abstract: Strong mobility enables migration of entire computations combining code, data, and execution state (such as stack and program counter) between sites of computation. This is in contrast to weak mobility where migration is confined to just code and data. Strong mobility is essential for many applications where reconstruction of execution states is either difficult or even impossible: load balancing, reduction of network latency and traffic, and resource-related migration, just to name a few. This paper presents a model, programming abstractions, implementation, and evaluation of thread-based strong mobility. The model extends and takes advantage of a distributed programming model based on automatic synchronization through dataflow variables. It comes as a natural extension of dataflow computing which carefully separates issues concerning distribution and mobility. The programming abstractions capture various migration scenarios which differ in how the source and destination site relate to the site initiating migration. The implementation is based on replicating concurrent lightweight threads between sites controlled by migration managers.
Url:
DOI: 10.1007/978-3-540-31845-3_12
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000082
- to stream Istex, to step Curation: 000057
- to stream Istex, to step Checkpoint: 001288
- to stream Main, to step Merge: 001985
- to stream Main, to step Curation: 001957
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Thread-Based Mobility in Oz</title><author><name sortKey="Havelka, Dragan" sort="Havelka, Dragan" uniqKey="Havelka D" first="Dragan" last="Havelka">Dragan Havelka</name></author><author><name sortKey="Schulte, Christian" sort="Schulte, Christian" uniqKey="Schulte C" first="Christian" last="Schulte">Christian Schulte</name></author><author><name sortKey="Brand, Per" sort="Brand, Per" uniqKey="Brand P" first="Per" last="Brand">Per Brand</name></author><author><name sortKey="Haridi, Seif" sort="Haridi, Seif" uniqKey="Haridi S" first="Seif" last="Haridi">Seif Haridi</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:3173CD700B7FE2EB4399970A6EC7BF8A294E5DCA</idno><date when="2005" year="2005">2005</date><idno type="doi">10.1007/978-3-540-31845-3_12</idno><idno type="url">https://api.istex.fr/document/3173CD700B7FE2EB4399970A6EC7BF8A294E5DCA/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000082</idno><idno type="wicri:Area/Istex/Curation">000057</idno><idno type="wicri:Area/Istex/Checkpoint">001288</idno><idno type="wicri:doubleKey">0302-9743:2005:Havelka D:thread:based:mobility</idno><idno type="wicri:Area/Main/Merge">001985</idno><idno type="wicri:Area/Main/Curation">001957</idno><idno type="wicri:Area/Main/Exploration">001957</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Thread-Based Mobility in Oz</title><author><name sortKey="Havelka, Dragan" sort="Havelka, Dragan" uniqKey="Havelka D" first="Dragan" last="Havelka">Dragan Havelka</name><affiliation wicri:level="1"><country xml:lang="fr">Suède</country><wicri:regionArea>IMIT, KTH – Royal Institute of Technology, Electrum 229, SE-16440, Kista</wicri:regionArea><wicri:noRegion>Kista</wicri:noRegion></affiliation><affiliation wicri:level="1"><country xml:lang="fr">Suède</country><wicri:regionArea>SICS – Swedish Institute of Computer Science, Box 1263, SE-16429, Kista</wicri:regionArea><wicri:noRegion>Kista</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Suède</country></affiliation></author><author><name sortKey="Schulte, Christian" sort="Schulte, Christian" uniqKey="Schulte C" first="Christian" last="Schulte">Christian Schulte</name><affiliation wicri:level="1"><country xml:lang="fr">Suède</country><wicri:regionArea>IMIT, KTH – Royal Institute of Technology, Electrum 229, SE-16440, Kista</wicri:regionArea><wicri:noRegion>Kista</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Suède</country></affiliation></author><author><name sortKey="Brand, Per" sort="Brand, Per" uniqKey="Brand P" first="Per" last="Brand">Per Brand</name><affiliation wicri:level="1"><country xml:lang="fr">Suède</country><wicri:regionArea>SICS – Swedish Institute of Computer Science, Box 1263, SE-16429, Kista</wicri:regionArea><wicri:noRegion>Kista</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Suède</country></affiliation></author><author><name sortKey="Haridi, Seif" sort="Haridi, Seif" uniqKey="Haridi S" first="Seif" last="Haridi">Seif Haridi</name><affiliation wicri:level="1"><country xml:lang="fr">Suède</country><wicri:regionArea>IMIT, KTH – Royal Institute of Technology, Electrum 229, SE-16440, Kista</wicri:regionArea><wicri:noRegion>Kista</wicri:noRegion></affiliation><affiliation wicri:level="1"><country xml:lang="fr">Suède</country><wicri:regionArea>SICS – Swedish Institute of Computer Science, Box 1263, SE-16429, Kista</wicri:regionArea><wicri:noRegion>Kista</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Suède</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2005</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno></series><idno type="istex">3173CD700B7FE2EB4399970A6EC7BF8A294E5DCA</idno><idno type="DOI">10.1007/978-3-540-31845-3_12</idno><idno type="ChapterID">Chap12</idno><idno type="ChapterID">12</idno></biblStruct></sourceDesc></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Strong mobility enables migration of entire computations combining code, data, and execution state (such as stack and program counter) between sites of computation. This is in contrast to weak mobility where migration is confined to just code and data. Strong mobility is essential for many applications where reconstruction of execution states is either difficult or even impossible: load balancing, reduction of network latency and traffic, and resource-related migration, just to name a few. This paper presents a model, programming abstractions, implementation, and evaluation of thread-based strong mobility. The model extends and takes advantage of a distributed programming model based on automatic synchronization through dataflow variables. It comes as a natural extension of dataflow computing which carefully separates issues concerning distribution and mobility. The programming abstractions capture various migration scenarios which differ in how the source and destination site relate to the site initiating migration. The implementation is based on replicating concurrent lightweight threads between sites controlled by migration managers.</div></front></TEI><affiliations><list><country><li>Suède</li></country></list><tree><country name="Suède"><noRegion><name sortKey="Havelka, Dragan" sort="Havelka, Dragan" uniqKey="Havelka D" first="Dragan" last="Havelka">Dragan Havelka</name></noRegion><name sortKey="Brand, Per" sort="Brand, Per" uniqKey="Brand P" first="Per" last="Brand">Per Brand</name><name sortKey="Brand, Per" sort="Brand, Per" uniqKey="Brand P" first="Per" last="Brand">Per Brand</name><name sortKey="Haridi, Seif" sort="Haridi, Seif" uniqKey="Haridi S" first="Seif" last="Haridi">Seif Haridi</name><name sortKey="Haridi, Seif" sort="Haridi, Seif" uniqKey="Haridi S" first="Seif" last="Haridi">Seif Haridi</name><name sortKey="Haridi, Seif" sort="Haridi, Seif" uniqKey="Haridi S" first="Seif" last="Haridi">Seif Haridi</name><name sortKey="Havelka, Dragan" sort="Havelka, Dragan" uniqKey="Havelka D" first="Dragan" last="Havelka">Dragan Havelka</name><name sortKey="Havelka, Dragan" sort="Havelka, Dragan" uniqKey="Havelka D" first="Dragan" last="Havelka">Dragan Havelka</name><name sortKey="Schulte, Christian" sort="Schulte, Christian" uniqKey="Schulte C" first="Christian" last="Schulte">Christian Schulte</name><name sortKey="Schulte, Christian" sort="Schulte, Christian" uniqKey="Schulte C" first="Christian" last="Schulte">Christian Schulte</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/MozartV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001957 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001957 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Musique
|area= MozartV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:3173CD700B7FE2EB4399970A6EC7BF8A294E5DCA
|texte= Thread-Based Mobility in Oz
}}
| This area was generated with Dilib version V0.6.20. |  |